Automatically Proving UNITY Safety Properties with Arrays and Quantifiers
نویسنده
چکیده
We address the general problem of automatically proving safety properties of reactive systems within the UNITY model. We take up a relational and set-based approach, and define some techniques to represent instructions and properties, allowing us to deal with arrays and quantification. An integration of these techniques into the OMEGA calculator, which we make use of with a significant example, now allows us to think of deep automation of non trivial theorem proving.
منابع مشابه
Automatically Proving Unity Safety Properties with Arrays and Quantiiers
We address the general problem of automatically proving safety properties of reactive systems within the Unity model. We take up a relational and set-based approach, and deene some techniques to represent instructions and properties, allowing us to deal with arrays and quantiication. An integration of these techniques into the Omega calculator, which we make use of with a signiicant example, no...
متن کاملLingva: Generating and Proving Program Properties Using Symbol Elimination
We describe the Lingva tool for generating and proving complex program properties using the recently introduced symbol elimination method. We present implementation details and report on a large number of experiments using academic benchmarks and open-source software programs. Our experiments show that Lingva can automatically generate quantified invariants, possibly with alternation of quantif...
متن کاملModel Checking for UNITYThe
We present a description of our current implementation of a model checker for nite state UNITY programs and propositional UNITY logic. The model checker is capable of dealing with all unconditional properties of UNITY logic. Checking safety properties and basic progress properties can be done very eeciently due to the partitioning of the transition relation of a program induced by the program s...
متن کاملThe Logical Part of Essentiality and Unity of Existence in Proving the Unity of Necessary Being
This article has no abstract.
متن کاملتوسعه روش SL با ترتیب KBO برای اثبات خودکار پایانپذیری سیستم بازنویسی ترم - مقاله برگزیده هفدهمین کنفرانس ملی انجمن کامپیوتر ایران
The term rewriting systems (TRSs) is an abstract model of functional languages. The termination proving of TRSs is necessary for confirming accuracy of functional languages. The semantic labeling (SL) is a complete method for proving termination. The semantic part of SL is given by a quasi-model of the rewrite rules. The most power of SL is related to infinite models that is difficult f...
متن کامل